The linear complementarity problem and a subclass of fully semimonotone matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pc { Matrices and the Linear Complementarity

We introduce a new matrix class Pc, which consists of those matrices M for which the solution set of the corresponding linear complementarity problem is connected for every q 2 I R n. We consider Lemke's pivotal method from the perspective of piecewise linear homotopies and normal maps and show that Lemke's method processes all matrices in Pc \Q0. We further investigate the relationship of the ...

متن کامل

The Linear Dynamic Complementarity Problem is a special case of the Extended Linear Complementarity Problem ∗

In this paper we consider some extensions of the Linear Complementarity Problem, which is one of the fundamental problems in mathematical programming. More specifically we consider the Linear Dynamic Complementarity Problem (LDCP), the Generalized Linear Complementarity Problem (GLCP) and the Extended Linear Complementarity Problem (ELCP). We show that the LDCP is a special case of the ELCP and...

متن کامل

The extended linear complementarity problem

In this paper we define the Extended Linear Complementarity Problem (ELCP), an extension of the well-known Linear Complementarity Problem (LCP). We show that the ELCP can be viewed as a kind of unifying framework for the LCP and its various generalizations. We study the general solution set of an ELCP and we develop an algorithm to find all its solutions. We also show that the general ELCP is a...

متن کامل

A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1987

ISSN: 0024-3795

DOI: 10.1016/0024-3795(87)90170-4